Simple transformation functions for finding better minima
نویسندگان
چکیده
منابع مشابه
Finding pathways between distant local minima.
We report a new algorithm for constructing pathways between local minima that involve a large number of intervening transition states on the potential energy surface. A significant improvement in efficiency has been achieved by changing the strategy for choosing successive pairs of local minima that serve as endpoints for the next search. We employ Dijkstra's algorithm [E. W. Dijkstra, Numer. M...
متن کاملFinding Path Minima in Incremental Unrooted Trees∗
Consider a dynamic forest of unrooted trees over a set of n vertices which we update by link operations: Each link operation adds a new edge adjacent to vertices in two different trees. Every edge in the forest has a weight associated with it, and at any time we want to be able to answer a path-min query which returns that edge of minimum weight along the path between two given vertices. For th...
متن کاملAsynchronously Parallel Optimization Solver for Finding Multiple Minima
This paper proposes and analyzes an asynchronously parallel optimization algorithm for finding multiple, highquality minima of nonlinear optimization problems. Our multistart algorithm considers all previously evaluated points when determining where to start or continue a local optimization run. Theoretical results show that, under certain assumptions, the algorithm almost surely starts a finit...
متن کاملA Batch, Derivative-Free Algorithm for Finding Multiple Local Minima
We propose a derivative-free algorithm for finding high-quality local minima for functions that require significant computational resources to evaluate. Our algorithm efficiently utilizes the computational resources allocated to it and also has strong theoretical results, almost surely starting a finite number of local optimization runs and identifying all local minima. We propose metrics for m...
متن کاملFinding Approximate Local Minima for Nonconvex Optimization in Linear Time
We design a non-convex second-order optimization algorithm that is guaranteed to return an approximate local minimum in time which is linear in the input representation. The previously fastest methods run in time proportional to matrix inversion or worse. The time complexity of our algorithm to find a local minimum is even faster than that of gradient descent to find a critical point (which can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2008
ISSN: 0893-9659
DOI: 10.1016/j.aml.2007.02.033